package leetCode.tree;

/**
 * 二叉树的层序遍历
 */
public class levelTraversal {



  /*  public List<List<Integer>> levelOrder(TreeNode root) {
        if (root == null || (root.left == null && root.right == null))

    }*/


}
